1916B - Two Divisors - CodeForces Solution

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define MOD 1000000007
int gcd(int a, int b){
    return b == 0 ? a : gcd(b, a % b);
}
int lcm(int a,int b){
    return ((a*b)/gcd(a,b));
}
bool fun(pair<int,int> a,pair<int,int> b){
    if(a.first!=b.first)
        return a.first<b.first;
    return a.second>b.second;
}
vector<bool> is_prime(1000001, true);
void SieveOfEratosthenes(int n)
{
    is_prime[0] = false;
    is_prime[1] = false;
    for (int i = 2; i <= n; i++) {
        if (is_prime[i] && (long long)i * i <= n) {
            for (int j = i * i; j <= n; j += i)
                is_prime[j] = false;
        }
    }
}
int compute_hash(string const& s) {
    int p = 31, m = 1e14 + 7, hash_value = 0, p_pow = 1;			//good choice for m is large prime number
    for (char c : s) {
        hash_value = (hash_value + (c - 'a' + 1) * p_pow) % m;
        p_pow = (p_pow * p) % m;
    }
    return hash_value;
}
void solve(){
    int a,b;
    cin>>a>>b;
    if(lcm(a,b)==max(a,b))
        cout<<max(a,b)/min(a,b)*lcm(a,b)<<endl;
    else
        cout<<lcm(a,b)<<endl;
}
int32_t main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int t;
    cin>>t;
    while(t--)
        solve();
    return 0;
}